New Multi-Commodity Flow Formulations for the Generalized Pooling Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New multi-commodity flow formulations for the pooling problem

The pooling problem is a nonconvex nonlinear programming problem with numerous applications. The nonlinearities of the problem arise from bilinear constraints that capture the blending of raw materials. Bilinear constraints are well-studied and significant progress has been made in solving large instances of the pooling problem to global optimality. This is due in no small part to reformulation...

متن کامل

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

The Capacitated Vehicle Routing Problem is a much-studied (and stronglyNP-hard) combinatorial optimization problem, for which many integer programming formulations have been proposed. We present two new multi-commodity flow (MCF) formulations, and show that they dominate all of the existing ones, in the sense that their continuous relaxations yield stronger lower bounds. Moreover, we show that ...

متن کامل

Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem

The sequential ordering problem (SOP) is the generalisation of the asymmetric travelling salesman problem in which there are precedence relations between pairs of nodes. Hernández & Salazar introduced a multi-commodity flow (MCF) formulation for a generalisation of the SOP in which the vehicle has a limited capacity. We strengthen this MCF formulation by fixing variables and adding valid equati...

متن کامل

New Formulations for the Generalized Traveling Salesman Problem

The Generalized Traveling Salesman Problem (GTSP) is an extension of the well known Traveling Salesman Problem (TSP). The GTSP is defined on a graph in which the nodes (customers or vertices) are grouped into a given number of clusters (node sets). Solution procedures for the GTSP are generally focused on transforming the problem to the TSP and applying the exact or heuristic solution methods d...

متن کامل

A Parallel Algorithm for Nonlinear Multi-commodity Network Flow Problem

In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method on several examples of NMNF problem and obtained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2018

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2018.09.293